2-colouring K4-e designs

نویسندگان

Mario Gionfriddo

C. C. Lindner

Christopher A. Rodger

چکیده

(A of of the G. The TH/.lm.hl'T n called the order of course, = A where IE(G)I is the number of nell'ambito del GNSAGA (CNR) con contributo MPI

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

List-colourings of Near-outerplanar Graphs

A list-colouring of a graph is an assignment of a colour to each vertex v from its own list L(v) of colours. Instead of colouring vertices we may want to colour other elements of a graph such as edges, faces, or any combination of vertices, edges and faces. In this thesis we will study several of these different types of list-colouring, each for the class of a near-outerplanar graphs. Since a g...

متن کامل

List-colouring the square of a K4-minor-free graph

Let G be a K4-minor-free graph with maximum degree . It is known that if ∈ {2, 3} then G2 is ( + 2)-degenerate, so that (G2) ch(G2) + 3. It is also known that if 4 then G2 is ( 3 2 + 1)-degenerate and (G2) 3 2 + 1. It is proved here that if 4 then G2 is 3 2 -degenerate and ch(G2) 3 2 + 1. These results are sharp. © 2007 Elsevier B.V. All rights reserved.

متن کامل

A Note on Edge-Colourings Avoiding Rainbow K4 and Monochromatic Km

We study the mixed Ramsey number maxR(n,Km,Kr), defined as the maximum number of colours in an edge-colouring of the complete graph Kn, such that Kn has no monochromatic complete subgraph on m vertices and no rainbow complete subgraph on r vertices. Improving an upper bound of Axenovich and Iverson, we show that maxR(n,Km,K4) ≤ n3/2 √ 2m for all m ≥ 3. Further, we discuss a possible way to impr...

متن کامل

The neighbour-sum-distinguishing edge-colouring game

Let γ : E(G) −→ N∗ be an edge colouring of a graph G and σγ : V (G) −→ N∗ the vertex colouring given by σγ(v) = ∑ e3v γ(e) for every v ∈ V (G). A neighbour-sumdistinguishing edge-colouring of G is an edge colouring γ such that for every edge uv in G, σγ(u) 6= σγ(v). The study of neighbour-sum-distinguishing edge-colouring of graphs was initiated by Karoński, Łuczak and Thomason [8]. They conjec...

متن کامل